Pareto Optimality in Coalition Formation
نویسندگان
چکیده
A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a far-reaching structural connection between Pareto optimal and perfect partitions that has various algorithmic consequences for coalition formation. In particular, we show that computing and verifying Pareto optimal partitions in general hedonic games and B-hedonic games is intractable while both problems are tractable for roommate games and W-hedonic games. The latter two positive results are obtained by reductions to maximum weight matching and clique packing, respectively.
منابع مشابه
Price of Pareto Optimality in Hedonic Games
Price of Anarchy measures the welfare loss caused by selfish behavior: it is defined as the ratio of the social welfare in a socially optimal outcome and in a worst Nash equilibrium. A similar measure can be derived for other classes of stable outcomes. In this paper, we argue that Pareto optimality can be seen as a notion of stability, and introduce the concept of Price of Pareto Optimality: t...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملMulti-agent models for searching Pareto optimal solutions to the problem of forming and dynamic restructuring of coalitions
The first part of this paper presents a coalition formation method for multi-agent systems which finds a Pareto optimal solution without aggregating the preferences of the agents. This protocol is adapted to problems requiring coordination by coalition formation, where it is undesirable, or not possible, to aggregate the preferences of the agents. The second part proposes an extension of this m...
متن کاملSolution of Multi-Objective optimal reactive power dispatch using pareto optimality particle swarm optimization method
For multi-objective optimal reactive power dispatch (MORPD), a new approach is proposed where simultaneous minimization of the active power transmission loss, the bus voltage deviation and the voltage stability index of a power system are achieved. Optimal settings of continuous and discrete control variables (e.g. generator voltages, tap positions of tap changing transformers and the number of...
متن کاملStability set, Pareto-optimality and single-peaked preferences
The emptiness of the core of a voting game can be viewed as the failure of a society to select a stable alternative : every alternative can be vetoed by a winning coalition. To solve this problem, also known as the paradox of voting, Rubinstein (1980) introduces the stability set by a clause of prudence in the core dominance relation which amounts to assume that individuals are aware of possibl...
متن کامل